Graph grammars with path-controlled embedding

Graph grammars with node-label controlled rewriting and embedding

Dependency Graphs Embedding Confluent Graph Grammars

Abstract: Graph grammars have been developed as an extension of the formal grammars on strings to grammars on graphs, and provide a mechanism in which transformations on graphs can be modeled in a mathematically precise way. In this paper, based on confluent graph grammars, the authors present a novel representation for data-flow graphs, control-flow graphs, combined control-data-graphs, bipart...

Further Properties of Path-Controlled Grammars

A path controlled grammar consists in a pair of CFGs, G1, G2, where G2 generates a language over the total alphabet of G1. A word w generated by G1 is accepted only if there is a derivation tree τ of w with respect to G1 such that there exists a path in τ , from the root to a leaf node, having the nodes marked by a word x which is in L(G2). We show that these grammars are slightly more powerful...

Graph-Controlled Grammars as Language Acceptors

In this paper, we study the concept of accepting grammars within various forms of regulated grammars like programmed grammars, matrix (set) grammars, grammars with regular (set) control, periodically time-variant grammars as variants of grammars controlled by bi-coloured digraphs. We focus on their descriptive capacity. In this way, we continue our studies of accepting grammars 1, 2, 3, 11, 13,...

Graph Embedding with Constraints

Recently graph based dimensionality reduction has received a lot of interests in many fields of information processing. Central to it is a graph structure which models the geometrical and discriminant structure of the data manifold. When label information is available, it is usually incorporated into the graph structure by modifying the weights between data points. In this paper, we propose a n...